Modifying Orthogonal Drawings for Label Placement
نویسندگان
چکیده
منابع مشابه
Modifying Orthogonal Drawings for Label Placement
Abstract: In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing). We investigate computational complexity issues of variations of that problem, and we present polynomial time algorithms that find the minimum increase ...
متن کاملLabeling Heuristics for Orthogonal Drawings
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which they are not assigned. The optimization goal is area minimization. We provide a unified framework that allows to easily design edge labeling heuristics. By using the framework we implemented and experimentally compared...
متن کاملComputing Labeled Orthogonal Drawings
This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as arectangle of prescribed size and it can be associated with either a vertex or an edge. Several additionaloptimization goals are taken into account. Namely, the labeled drawing can be required to have eitherminimum total edge length, or minimum width, or minimum height, or minimum area...
متن کاملOverloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity of representation. In this paper we present a technique called Overloaded Orthogonal Drawing. We first place the vertices on grid points following a relaxed version of dominance drawing, called weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these...
متن کاملAlgorithms for Area-E cient Orthogonal Drawings
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our algorithm needs area no greater than 0:76n 2 , and introduces no more ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2016
ISSN: 1999-4893
DOI: 10.3390/a9020022